Transversal of disjoint convex polygons
نویسندگان
چکیده
Given a set S of n disjoint convex polygons {Pi | 1 i n} in a plane, each with ki vertices, the transversal problem is to find, if there exists one, a straight line that goes through every polygon in S. We show that the transversal problem can be solved in O(N + n logn) time, where N = ni=1 ki is the total number of vertices of the polygons. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Line Transversals for Homothetical Systems of Polygons in R
The problem considered in this article is: ‘for given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c > 1 that the transformed system has a transversal’. We prove that in this ‘minimal configuration’, we can always find three polygons (two of them...
متن کاملOn Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملDecompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملEqual Area Polygons in Convex Bodies
In this paper, we consider the problem of packing two or more equal area polygons with disjoint interiors into a convex body K in E such that each of them has at most a given number of sides. We show that for a convex quadrilateral K of area 1, there exist n internally disjoint triangles of equal area such that the sum of their areas is at least 4n 4n+1 . We also prove results for other types o...
متن کاملThe Harmony of Spheres
Let F = {X1, . . . , Xn} be a family of disjoint compact convex sets in R. An oriented straight line ` that intersects every Xi is called a (line) transversal to F . A transversal naturally induces an ordering of the elements of F , this ordering, together with its reverse (which is induced by the same line with opposite orientation), is called a geometric permutation. Geometric transversal the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 85 شماره
صفحات -
تاریخ انتشار 2003